Comparison of Offline and Online Algorithms for Fully-Dynamic Graph Connectivity
نویسنده
چکیده
In the fully dynamic graph connectivity problem we are modifying a graph by inserting and deleting edges and answering queries if two vertices are connected by a path. For the offline case we are given all of the queries and modifications beforehand, while for the online we should respond without any knowledge for the future operations. In this paper we are going to compare implementation of the online algorithm by Holm, de Lichtenberg, and Thorup[1] which has running time of O(log n) per operation with an implementations of a modified version of Eppstein’s O(log n) offline algorithm for dynamic minimum spanning tree[2] adapted to solve dynamic connectivity.
منابع مشابه
A Survey on Complexity of Integrity Parameter
Many graph theoretical parameters have been used to describe the vulnerability of communication networks, including toughness, binding number, rate of disruption, neighbor-connectivity, integrity, mean integrity, edgeconnectivity vector, l-connectivity and tenacity. In this paper we discuss Integrity and its properties in vulnerability calculation. The integrity of a graph G, I(G), is defined t...
متن کاملQuasi-Fully Dynamic Algorithms for Two-Connectivity, Cycle Equivalence and Related Problems
In this paper we introduce a new class of dynamic graph algorithms called quasi-fully dynamic algorithms, which are much more general than the backtracking algorithms and are much simpler than the fully dynamic algorithms. These algorithms are especially suitable for applications in which a certain core connected portion of the graph remains xed, and fully dynamic updates occur on the remaining...
متن کاملTowards a measure of vulnerability, tenacity of a Graph
If we think of the graph as modeling a network, the vulnerability measure the resistance of the network to disruption of operation after the failure of certain stations or communication links. Many graph theoretical parameters have been used to describe the vulnerability of communication networks, including connectivity, integrity, toughness, binding number and tenacity.In this paper we discuss...
متن کاملDynamically maintaining split graphs
We present an algorithm that supports operations for modifying a split graph by adding edges or vertices and deleting edges, such that after eachmodification the graph is repaired to become a split graph in a minimal way. In particular, if the graph is not split after the modification, the algorithm computes a minimal, or if desired even a minimum, split completion or deletion of themodified gr...
متن کاملOffline Dynamic Higher Connectivity
We give the first O(t log t) time algorithm for processing a given sequence of t edge updates and 3-vertex/edge connectivity queries in an undirected unweighted graph. Our approach builds upon a method by Eppstein [Epp94] that reduces graphs to smaller equivalents on a set of key vertices. It also leads to algorithms for offline 2-vertex/edge connectivity whose performances match those from Kac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013